منابع مشابه
The Mixed Binary Euclid Algorithm
We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and prove that its bit-time complexity is still O(n) for two n-bit integers. However, our preliminar experiments show that it is very fast for small integers. A parallel version of this algorithm matches the best presently known time complexity, na...
متن کاملEuclid ’ s Algorithm Andrzej
The main goal of the paper is to prove the correctness of the Euclid’s algorithm for SCM. We define the Euclid’s algorithm and describe the natural semantics of it. Eventually we prove that the Euclid’s algorithm computes the Euclid’s function. Let us observe that the Euclid’s function is defined as a function mapping finite partial states to finite partial states of SCM rather than pairs of in...
متن کاملThe Euclid algorithm is “totally” gaussian
We consider Euclid’s gcd algorithm for two integers (p, q) with 1 ≤ p ≤ q ≤ N , with the uniform distribution on input pairs. We study the distribution of the total cost of execution of the algorithm for an additive cost function d on the set of possible digits, asymptotically for N → ∞. For any additive cost of moderate growth d, Baladi and Vallée obtained a central limit theorem, and –in the ...
متن کاملEuclid Writes an Algorithm: A Fairytale
How Euclid might have written and checked the correctness of his famous algorithm had he been a little further ahead of his time. Euclid of Alexandria was thinking. A traveler had that morning told him of a marvelous thing he had learned many years earlier from Eudoxus of Cnidus: a marvelous way to find the greatest common divisor of two numbers. But Eudoxus had not revealed the proof, and Eucl...
متن کاملSharp Estimates for the Main Parameters of the Euclid Algorithm
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid algorithm, and we study in particular the distribution of the bit-complexity which involves two main parameters : digit–costs and length of continuants. We perform a “dynamical analysis” which heavily uses the dynamical system underlying the Euclidean algorithm. Baladi and Vallée [2] have recently de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.11.029